POISSON APPROXIMATION FOR THE NUMBER OF ISOLATED CYCLES IN A RANDOM INTERSECTION GRAPH
نویسندگان
چکیده
منابع مشابه
Poisson Approximation of the Number of Cliques in Random Intersection Graphs
A random intersection graph G(n,m, p) is defined on a set V of n vertices. There is an auxiliary set W consisting of m objects, and each vertex v ∈ V is assigned a random subset of objects Wv ⊆ W such that w ∈ Wv with probability p, independently for all v ∈ V and all w ∈ W . Given two vertices v1, v2 ∈ V, we set v1 ∼ v2 if and only if Wv1 ∩Wv2 = ∅. We use Stein’s method to obtain an upper boun...
متن کاملOn the bounds in Poisson approximation for independent geometric distributed random variables
The main purpose of this note is to establish some bounds in Poisson approximation for row-wise arrays of independent geometric distributed random variables using the operator method. Some results related to random sums of independent geometric distributed random variables are also investigated.
متن کاملOn the number of hamilton cycles in a random graph
Let a random graph G be constructed by adding random edges one by one, starting with n isolated vertices. We show that with probability going to one as n goes to infinity, when G first has minimum degree two, it has at least (logn)^ * distinct hamilton cycles for any fixed e > 0. §1, Introduction Let V = {lf2,...,n} and consider the random graph process (Bollobas [3]) G0,Gr ....G^, v = (£) wher...
متن کاملA Pointwise Approximation of Isolated Trees in a Random Graph
In this paper, we give a pointwise approximation of the number of isolated trees of order k in a random graph by Poisson distribution. The technique we used here is the Stein’s method.
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pure and Apllied Mathematics
سال: 2014
ISSN: 1311-8080,1314-3395
DOI: 10.12732/ijpam.v93i5.13